Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
نویسندگان
چکیده
منابع مشابه
Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
This paper gives the linear complexity of binary Ding-Helleseth generalized cyclo-tomic sequences of any order.
متن کاملOn the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six
We propose a new computation method for the linear complexity and the minimal polynomial of Ding-Helleseth-generalized cyclotomic sequences. We will find the linear complexity of DingHelleseth-generalized cyclotomic sequences of order four and six and make the results of Tongjiang Yan et. al [19] about the sequences of order four more specific. 2010 Mathematics Subject Classifications: 11B50, 9...
متن کاملThe Linear Complexity of Whiteman’s Generalized Cyclotomic Sequences of Period
In this paper, we mainly get three results. First, let , be distinct primes with ; we give a method to compute the linear complexity of Whiteman’s generalized cyclotomic sequences of period . Second, if , we compute the exact linear complexity of Whiteman’s generalized cyclotomic sequences. Third, if , , and we fix a common primitive root of both and , then , which is a subgroup of the multipli...
متن کاملAbout the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.
متن کاملOn error linear complexity of new generalized cyclotomic binary sequences of period p2
We consider the k-error linear complexity of a new binary sequence of period p2, proposed in the recent paper “New generalized cyclotomic binary sequences of period p2”, by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://doi.org/10.1007/s10623017-0408-7). More exactly, we determine the values of k-error linear complexity over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 1997
ISSN: 1071-5797
DOI: 10.1006/ffta.1997.0181